A New Multisignature Scheme based on Strong Diffie-Hellman Assumption

نویسندگان

  • Duc-Phong Le
  • Alban Gabillon
چکیده

Digital multisignatures improve security of digital signatures and reduce fraud by collusion. In this paper we first present a new secure signature scheme which is based on a variant of Strong Diffie-Hellman Assumption, called SDH2 assumption. Then, we extend this signature for a new multisignature scheme without interaction between users. Our proposed schemes which work in groups equipped with efficient bilinear map are provably secure without random oracles. We also compare our schemes with previous works.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identity-Based Multisignature with Message Recovery

We present a new notion of short identity-based multisignature scheme with message recovery. We propose a concrete identity-based multisignature with message recovery scheme based on bilinear pairing in which multiple signers can generate a constant size multisignature on same message regardless of the number of signers. There is no requirement to transmit the original message to the verifier, ...

متن کامل

Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme

We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem is hard but the Decisional Diffie-Hellman problem is easy). Our constructions are based on the recently proposed GDH signature scheme of Boneh et al. [BLS]. Due to the instrumental structur...

متن کامل

Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational DiffieHellman problem is hard but the Decisional Diffie-Hellman problem is easy). Our constructions are based on the recently proposed GDH signature scheme of Boneh et al. [8]. Due to the instrumental structure o...

متن کامل

Secure acknowledgment aggregation and multisignatures with limited robustness

In certain reliable group-oriented and multicast applications, a source needs to securely verify whether all (and if not all, which) intended receivers have received a message. However, secure verification of individual acknowledgments from all receivers can impose a significant computation and communication burden. Such cost can be significantly reduced if intermediate nodes along the distribu...

متن کامل

A Structured Aggregate Signature Scheme with Pairing-based Cryptography

In this study, we propose a new aggregate signature scheme with pairing-based cryptography that can describe the mixed/parallel structure of signers. Existing structured signature schemes are based on multisignature schemes, which are adapted for verification of a mixed/parallel structure if all signers sign the same document. However, if each signer wants to sign a document different from thos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007